Covering a polygonal region by rectangles
نویسندگان
چکیده
The problem of covering a compact canonical polygonal region, called target region, with a finite family of rectangles is considered. Tools for mathematical modeling of the problem are provided. Especially, a function, called Γ-function, is introduced which indicates whether the rectangles with respect to their configuration form a cover of the target region or not. The construction of the Γ-function is similar to that of Φ-functions which have been proved to be an efficient tool for packing problems. A mathematical model of the covering problem based on the Γ-function is proposed as well as a solution strategy. The approach is illustrated by an example.
منابع مشابه
One-dimensional relaxations for the problem of covering a polygonal region by rectangles
The problem of covering a polygonal target set by a finite number of rectangles is a hard decision problem. The aim of the paper is to develop necessary conditions which have to be fulfilled by any covering. For that reason several one-dimensional relaxations are considered and cover-feasible functions are introduced.
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملFat Polygonal Partitions with Applications to Visualization and Embeddings
Let T be a rooted and weighted tree, where the weight of any node is equal to the sum of the weights of its children. The popular Treemap algorithm visualizes such a tree as a hierarchical partition of a square into rectangles, where the area of the rectangle corresponding to any node in T is equal to the weight of that node. The aspect ratio of the rectangles in such a rectangular partition ne...
متن کاملA New Method of Image Compression using Irreducible Covers of Maximum Rectangles
In recent years there has been a tremendous spurt in research and activity in finding efficient compression techniques for image processing applications. Particularly when an image is structured over a nonrectangular region, it is always advantageous to define a method of covering a region by minimal numbers of maximal rectangles. Towards this objective, we analyze the binary image compression ...
متن کاملCovering a Point Set by Two Disjoint Rectangles
Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pair of disjoint rectangles such that their union contains S and the area of the larger rectangle is minimized. In this paper we consider two variants of this optimization problem: (1) the rectangles are free to rotate but must remain parallel to each other, and (2) one rectangle is axis-parallel bu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comp. Opt. and Appl.
دوره 48 شماره
صفحات -
تاریخ انتشار 2011